Bookmark-Coloring Algorithm for Personalized PageRank Computing
نویسندگان
چکیده
منابع مشابه
Bookmark-Coloring Algorithm for Personalized PageRank Computing
We introduce a novel bookmark-coloring algorithm (BCA) that computes authority weights over the web pages utilizing the web hyperlink structure. The computed vector (BCV) is similar to the PageRank vector defined for a page-specific teleportation. Meanwhile, BCA is very fast, and BCV is sparse. BCA also has important algebraic properties. If several BCVs corresponding to a set of pages (called ...
متن کاملBookmark-Coloring Approach to Personalized PageRank Computing
Below we introduce a novel bookmark-coloring algorithm (BCA) that computes authority weights over the Web pages utilizing the Web hyperlink structure. The computed vector (BCV) is similar to the PageRank vector defined for a page-specific teleportation. Meanwhile, BCA is very fast and BCV is sparse. BCA also has important algebraic properties. If several BCVs corresponding to a set of pages (ca...
متن کاملA Power-Arnoldi algorithm for computing PageRank
The PageRank algorithm plays an important role in modern search engine technology. It involves using the classical power method to compute the principle eigenvector of the Google matrix representing the web link graph. However, when the largest eigenvalue is not well separated from the second one, the power method may perform poorly. This happens when the damping factor is sufficiently close to...
متن کاملFast Ad-Hoc Search Algorithm for Personalized PageRank
あらまし Personalized PageRank (PPR) はグラフにおけるノード間の代表的な類似度であり,PPR に対 するノードの検索は多くのアプリケーションにおいて用いられている.多くのアプリケーションにおいてグラフ は動的に変化する性質があるなどの理由から,PPR に対してアドホックな検索が行えることが望ましい.アド ホックな検索とは,検索を行うごとに検索対象のグラフやパラメータを変えながら検索を行うことである.しか しグラフのサイズが大きくなるとアドホックに検索を行う計算コストが高くなるという問題がある.過去にも PPR の計算コストを低減するためにさまざまな手法が提案されてきた.しかしそれらの手法は事前計算が必要 であったり,近似的な検索結果になるなどの理由から有効にアドホックな検索を行えないという問題があった. 本論文では PPR に対してアドホックな検索を行う高...
متن کاملEfficient Algorithms for Personalized PageRank
We present new, more efficient algorithms for estimating random walk scores such as Personalized PageRank from a given source node to one or several target nodes. These scores are useful for personalized search and recommendations on networks including social networks, user-item networks, and the web. Past work has proposed using Monte Carlo or using linear algebra to estimate scores from a sin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2006
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2006.10129116